Additive Bases in Groups
نویسندگان
چکیده
We study the problem of removing an element from an additive basis in a general abelian group. We introduce analogues of the classical functions X,S and E (defined in the case of N) and obtain bounds on them. Our estimates on the functions SG and EG are valid for general abelian groups G while in the case of XG we show that distinct types of behaviours may occur depending on G.
منابع مشابه
Additive Bases and Extremal Problems in Groups, Graphs and Networks
Bases in sets and groups and their extremal problems have been studied in additive number theory such as the postage stamp problem. On the other hand, Cayley graphs based on specific finite groups have been studied in algebraic graph theory and applied to construct efficient communication networks such as circulant networks with minimum diameter (or transmission delay). In this paper we establi...
متن کاملAdditive Bases in Abelian Groups
Let G be a finite, non-trivial abelian group of exponent m, and suppose that B1, . . . , Bk are generating subsets of G. We prove that if k > 2m ln log2 |G|, then the multiset union B1 ∪ · · · ∪ Bk forms an additive basis of G; that is, for every g ∈ G there exist A1 ⊆ B1, . . . , Ak ⊆ Bk such that g = ∑k i=1 ∑ a∈Ai a. This generalizes a result of Alon, Linial, and Meshulam on the additive base...
متن کاملNear-best Basis Selection Algorithms with Non-additive Information Cost Functions
Search algorithms for finding signal decompositions called near-best bases using decision criteria called non-additive information costs are proposed for selecting bases in wavelet packet transforms. These new methods are compared with the best bases and additive information costs of Coifman and Wickerhauser [1]. All near-best and best bases were also compared with the matching pursuit decompos...
متن کاملTop-Down and Bottom-Up Tree Search Algorithms for Selecting Bases in Wavelet Packet Transforms
Search algorithms for finding signal decompositions called near-best bases using decision criteria called non-additive information costs have recently been proposed by Taswell [12] for selecting bases in wavelet packet transforms represented as binary trees. These methods are extended here to distinguish between top-down and bottom-up tree searches. Other new non-additive information cost funct...
متن کاملOn the Additive Bases Problem in Finite Fields
We prove that if G is an Abelian group and A1, . . . , Ak ⊆ G satisfy mAi = G (the m-fold sumset), then A1 + · · · + Ak = G provided that k > cm log log |G|. This generalizes a result of Alon, Linial, and Meshulam [Additive bases of vector spaces over prime fields. J. Combin. Theory Ser. A, 57(2):203–210, 1991] regarding so-called additive bases.
متن کامل